Tiered Byzantine-Fault Tolerance for Long-Term Integrity

نویسندگان

  • Byung-Gon Chun
  • Petros Maniatis
  • Scott Shenker
  • John Kubiatowicz
چکیده

Long-term services that operate reliably are hard to construct. In this paper, we argue that for long-term services we need a stronger service property called Healthy-WriteImplies-Correct-Read (HWICR): once a value is written in a healthy period (i.e., when the system’s fault assumption is not violated), the value is correctly read despite intervening unhealthy periods. To build services with the HWICR property, we adapt the traditional Byzantine-fault model to a tiered fault model, that allows customizing fault assumptions to different system components; the refined fault model allows services with a long-term horizon to handle the inevitable but rare violations of more traditional fault assumptions. As a specific case study, we present TimeMachine, a Byzantine-fault tolerant keyvalue store that provides the HWICR property under a three-tier fault model. We justify the design and tiered fault model behind TimeMachine, present an implementation, and show experimental results suggesting it is a practical solution to the long-open problem of long-term archival storage integrity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tiered Fault Tolerance for Long-Term Integrity

Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fault threshold is violated, correctness is lost. We revisit the notion of fault thresholds in the context of long-term archival storage. We observe that fault thresholds are inevitably violated in longterm services, maki...

متن کامل

Byzantine fault tolerance for session-oriented multi-tiered applications

This article presents a lightweight Byzantine fault tolerance (BFT) framework for session-oriented multi-tiered applications. We conclude that it is sufficient to use a lightweight BFT algorithm instead of a traditional BFT algorithm, based on a comprehensive study of the threat model to, and the state model of, the session-oriented multi-tiered applications. The lightweight BFT algorithm uses ...

متن کامل

PBFT vs Proof-of-Authority: Applying the CAP Theorem to Permissioned Blockchain

Permissioned blockchains are arising as a solution to federate companies prompting accountable interactions. A variety of consensus algorithms for such blockchains have been proposed, each of which has different benefits and drawbacks. Proof-of-Authority (PoA) is a new family of Byzantine fault-tolerant (BFT) consensus algorithms largely used in practice to ensure better performance than tradit...

متن کامل

Modeling and Verification of Leaders Agreement in the Intrusion-Tolerant Enclaves Using PVS

Enclaves is a group-oriented intrusion-tolerant protocol. Intrusion-tolerant protocols are cryptographic protocols that implement fault-tolerance techniques to achieve security despite possible intrusions at some parts of the system. Among the most tedious faults to handle in security are the so-called Byzantine faults, where insiders maliciously exhibit an arbitrary (possibly dishonest) behavi...

متن کامل

Hosting Byzantine Fault Tolerant Services on a Chord Ring

In this paper we demonstrate how stateful Byzantine Fault Tolerant services may be hosted on a Chord ring. The strategy presented is fourfold: firstly a replication scheme that dissociates the maintenance of replicated service state from ring recovery is developed. Secondly, clients of the ring based services are made replication aware. Thirdly, a consensus protocol is introduced that supports ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008